By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 24, Issue 2, pp. 203-410

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

A Randomized Maximum-Flow Algorithm

Joseph Cheriyan and Torben Hagerup

pp. 203-226

BibTeX  Abstract Full Text:  PDF

Sparse Approximate Solutions to Linear Systems

B. K. Natarajan

pp. 227-234

BibTeX  Abstract Full Text:  PDF

A Heuristic Scheduling of Independent Tasks with Bottleneck Resource Constraints

Qingzhou Wang and Ernst L. Leiss

pp. 235-241

BibTeX  Abstract Full Text:  PDF

On Computing Algebraic Functions Using Logarithms and Exponentials

Dima Grigoriev, Michael Singer, and Andrew Yao

pp. 242-246

BibTeX  Abstract Full Text:  PDF

Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs

Sanjiv Kapoor and H. Ramesh

pp. 247-265

BibTeX  Abstract Full Text:  PDF

Permuting in Place

Faith E. Fich, J. Ian Munro, and Patricio V. Poblete

pp. 266-278

BibTeX  Abstract Full Text:  PDF

The Complexity and Distribution of Hard Problems

David W. Juedes and Jack H. Lutz

pp. 279-295

BibTeX  Abstract Full Text:  PDF

A General Approximation Technique for Constrained Forest Problems

Michel X. Goemans and David P. Williamson

pp. 296-317

BibTeX  Abstract Full Text:  PDF

$\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems

Gilad Koren and Dennis Shasha

pp. 318-339

BibTeX  Abstract Full Text:  PDF

Ordered and Unordered Tree Inclusion

Pekka Kilpeläinen and Heikki Mannila

pp. 340-356

BibTeX  Abstract Full Text:  PDF

Randomized Interpolation and Approximation of Sparse Polynomials

Yishay Mansour

pp. 357-368

BibTeX  Abstract Full Text:  PDF

An ${\mathcal{N} \mathcal{C}}$ Algorithm for Evaluating Monotone Planar Circuits

A. L. Delcher and S. Rao Kosaraju

pp. 369-375

BibTeX  Abstract Full Text:  PDF

Private Computations over the Integers

Benny Chor, Mihály Geréb-Graus, and Eyal Kushilevitz

pp. 376-386

BibTeX  Abstract Full Text:  PDF

Sparse Polynomial Interpolation in Nonstandard Bases

Y. N. Lakshman and B. David Saunders

pp. 387-397

BibTeX  Abstract Full Text:  PDF

A New Approach to Formal Language Theory by Kolmogorov Complexity

Ming Li and Paul Vitányi

pp. 398-410

BibTeX  Abstract Full Text:  PDF